Combinatorial optimization - PDFSEARCH.IO - Document Search Engine

Combinatorial optimization
Results: 1158

#	Item
361	An Interactive Approach to Route Search Yaron Kanza∗ Roy Levin∗ Technion Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2010-10-06 07:24:10 Search algorithms Theoretical computer science Combinatorial optimization Routing algorithms Network theory Shortest path problem A* search algorithm Greedy algorithm Algorithm Mathematics Applied mathematics Combinatorics
362	Decomposition in Integer Linear Programming T.K. Ralphs∗ M.V. Galati† Revised August 16, 2005 Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2010-06-19 14:25:51 Operations research Combinatorial optimization Linear programming Convex optimization Linear programming relaxation Cutting-plane method Travelling salesman problem Relaxation Optimization problem Mathematical optimization Theoretical computer science Mathematics
363	Int. J. Production Economics ∎ (∎∎∎∎) ∎∎∎–∎∎∎ Contents lists available at SciVerse ScienceDirect Int. J. Production Economics journal homepage: www.elsevier.com/locate/ijpe Add to Reading List Source URL: isiarticles.com Language: English Theoretical computer science Operations research Mathematical optimization Combinatorial optimization Discrete geometry Bin packing problem Packing problem Genetic algorithm Cutting stock problem Mathematics Applied mathematics Packaging
364	Bayesian network learning with cutting planes James Cussens Dept of Computer Science & York Centre for Complex Systems Analysis University of York, Deramore Lane, York, YO10 5GH, UK Add to Reading List Source URL: dslpitt.org Language: English - Date: 2011-09-21 23:06:45 Mathematics Combinatorial optimization Cutting-plane method Numerical software Linear programming relaxation SCIP Bayesian network Linear programming Mathematical optimization Operations research Numerical analysis
365	Finding sparse, equivalent SDPs using linear programming and combinatorial techniques Frank Permenter Abstract— We present a new method for simplifying SDPs that blends aspects of symmetry reduction with sparsity explo Add to Reading List Source URL: www.mit.edu Language: English - Date: 2015-04-01 08:42:57 Mathematical optimization Matrix theory Linear algebra Linear programming Semidefinite programming Sum-of-squares optimization Hadamard product Matrix Rank Algebra Mathematics Operations research
366	COATI Combinatorics, Optimization and Algorithms for TelecommunIcations Équipe-projet commune I3S (CNRS/Université Nice Sophia-Antipolis) Add to Reading List Source URL: leat.unice.fr Language: English - Date: 2015-02-27 18:05:22 Combinatorial optimization Mathematics Graph theory Linear programming Mathematical sciences Operations research Applied mathematics Mathematical optimization
367	Approximately Counting Perfect Matchings in General Graphs Martin F¨ urer ∗ Shiva Prasad Kasiviswanathan Computer Science and Engineering Pennsylvania State University University Park, PA 16802. {furer, kasivisw}@cse. Add to Reading List Source URL: www.siam.org Language: English - Date: 2005-07-06 08:19:14 Matching Computational problems Algebraic graph theory Combinatorial optimization Computing the permanent Randomized algorithm Graph factorization Adjacency matrix Bipartite graph Mathematics Graph theory Theoretical computer science
368	Computing Full Disjunctions∗ (Extended Abstract) Yaron Kanza Yehoshua Sagiv Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-07-05 10:44:30 Combinatorial optimization Matching Tree Graph factorization Graph coloring NP-complete problems Computational problems Edge coloring Graph theory Theoretical computer science Mathematics
369	1 Greedy Gossip with Eavesdropping ? ¨ Deniz Ustebay Add to Reading List Source URL: www.tsp.ece.mcgill.ca Language: English - Date: 2011-03-22 10:34:09 Gasoline gallon equivalent Measurement Distributed data storage Mathematical analysis Combinatorial optimization Convex optimization Mathematical optimization Subgradient method
370	CCCG 2011, Toronto ON, August 10–12, 2011 Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences Mustafa Mohamad Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Combinatorial optimization Matching Analysis of algorithms Operations research Dynamic programming Optimal control Hungarian algorithm Algorithm Time complexity Theoretical computer science Mathematics Applied mathematics

UPDATE